Перевод: с английского на русский

с русского на английский

conjunctive search

См. также в других словарях:

  • conjunctive search — konjunktyvioji paieška statusas T sritis informatika apibrėžtis ↑Paieška duomenų, atitinkančių visus ↑paieškos požymius. Naudojama tada, kai galima nurodyti keletą paieškos požymių, pavyzdžiui, patikslintoje paieškoje žiniatinklyje, paieškoje… …   Enciklopedinis kompiuterijos žodynas

  • Local search (constraint satisfaction) — In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. It is based on iteratively improving an assignment of the variables until all constraints are satisfied. In particular, local search algorithms… …   Wikipedia

  • konjunktyvioji paieška — statusas T sritis informatika apibrėžtis ↑Paieška duomenų, atitinkančių visus ↑paieškos požymius. Naudojama tada, kai galima nurodyti keletą paieškos požymių, pavyzdžiui, patikslintoje paieškoje žiniatinklyje, paieškoje duomenų bazėje ir kt.… …   Enciklopedinis kompiuterijos žodynas

  • конъюнктивный поиск — Поиск документов, в каждом из которых встречаются все перечисленные ключевые слова. В основе рассматриваемого поиска лежит конъюнкция. [Гипертекстовый энциклопедический словарь по информатике Э. Якубайтиса] [http://www.morepc.ru/dict/] Тематики… …   Справочник технического переводчика

  • RDFLib — Infobox Software name = RDFLib developer = Daniel Krech latest release version = 2.4.0 latest release date = April 4, 2007 operating system = Cross platform genre = Library license = BSD website = [http://rdflib.net/ http://rdflib.net/] RDFLib is …   Wikipedia

  • 2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …   Wikipedia

  • Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… …   Wikipedia

  • Constraint satisfaction problem — Constraint satisfaction problems (CSP)s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite… …   Wikipedia

  • Data integration — involves combining data residing in different sources and providing users with a unified view of these data.[1] This process becomes significant in a variety of situations, which include both commercial (when two similar companies need to merge… …   Wikipedia

  • BIBLE — THE CANON, TEXT, AND EDITIONS canon general titles the canon the significance of the canon the process of canonization contents and titles of the books the tripartite canon …   Encyclopedia of Judaism

  • Cook–Levin theorem — In computational complexity theory, the Cook–Levin theorem, also known as Cook s theorem, states that the Boolean satisfiability problem is NP complete. That is, any problem in NP can be reduced in polynomial time by a deterministic Turing… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»